Scalable Situated Task Allocation

نویسندگان

  • Mathijs de Weerdt
  • Tomas Klos
چکیده

Existing task allocation methods broadcast a request when they do not know who to ask for a certain task. In many situations this is not a good idea, either because of the burden on all other agents, or because not everyone can be trusted with the information that this task is requested. When considering coalitions, existing methods try all combinations, but sometimes need to limit the maximum coalition size because of the computational complexity. We think that in most applications it makes much more sense to limit the coalitions that are considered by the structure of the network and reputations of the agents.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

متن کامل

Design of Structure and Realisation of Game Rules Database of Robot-Soccer Game

In this paper we developed system for coordinatization the robot-soccer game. This coordinatization we want to use for strategy extraction. The robot soccer is bimilar ant-like systems, which take advantage of agents’ situatedness to reduce or eliminate the need for centralized control or global knowledge. This reduces the need for complexity of individuals and leads to robust, scalable systems...

متن کامل

Auction Equilibrium Strategies for Task Allocation in Uncertain Environments

In this paper we address a model of self interested information agents competing to perform tasks. The agents are situated in an uncertain environment while different tasks dynamically arrive from a central manager. The agents differ in their capabilities to perform a task under different world states. Previous models concerning cooperative agents aiming for a joint goal are not applicable in s...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Task Allocation in Dynamic Networks of Satellites

The management of distributed satellite systems requires the coordination of a large number of heterogeneous spacecraft. Task allocation in such a system is complicated by limited communication and individual satellite dynamics. Previous work has shown that task allocation using a market-based mechanism can provide scalable and efficient management of static networks; in this paper we extend th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006